On the construction of prefix-free and fix-free codes with specified codeword compositions
نویسندگان
چکیده
We investigate the construction of prefix-free and fix-free codes with specified codeword compositions. We present a polynomial time algorithm which constructs a fix-free code with the same codeword compositions as a given code for a special class of codes called distinct codes. We consider the construction of optimal fix-free codes which minimize the average codeword cost for general letter costs with uniform distribution of the codewords and present an approximation algorithm to find a near optimal fix-free code with a given constant cost.
منابع مشابه
-Conjecture for Fix-Free Codes
A fix-free code is a code, which is prefix-free and suffix-free, i.e. any codeword of a fix-free code is neither a prefix, nor a suffix of another codeword. Fix-free codes were first introduced by Schützenberg (4) and Gilbert and Moore (5), where they were called never-self-synchronizing codes. Ahlswede, Balkenhol and Khachatrian propose in (6) the conjecture that a Kraftsum of a lengths sequen...
متن کاملSome basic properties of fix-free codes
a variable-length code is a fix-free code if no codeword is a prefix or a suffix of any other codeword. This class of codes is applied to speed up the decoding process, for the decoder can decode from both sides of the compressed file simultaneously. In this paper, we study some basic properties of fix-free codes. We prove a sufficient and a necessary condition for the existence of fix-free cod...
متن کاملNew Binary Fix-Free Codes with Kraft Sum
Two sufficient conditions are given for the existence of binary fix-free codes. The results move closer to the Ahlswede-Balkenhol-Khachatrian conjecture that Kraft sums of at most suffice for the existence of fix-free codes. For each nonnegative integer let denote the set of all binary words of length , and let denote the set of all finite length binary words, including the empty word. A binary...
متن کاملNew Binary Fix - Free Codes with Kraft Sum 3 = 4
Two sufficient conditions are given for the existence of binary fix-free codes. The results move closer to the Ahlswede-Balkenhol-Khachatrian conjecture that Kraft sums of at most 3=4 suffice for the existence of fix-free codes. For each nonnegative integer n let f0; 1gn denote the set of all binary words of length n, and let f0; 1g denote the set of all finite length binary words, including th...
متن کاملSome Properties of Fix { Free Codes
A (variable length) code is x { free code if no codeword is a preex or a suux of any other. A database constructed by a x { free code is instantaneously decodeable from both sides. We discuss the existence of x { free codes, relations to the deBrujin Network and shadow problems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 159 شماره
صفحات -
تاریخ انتشار 2011